CONTIGUITY AND CONDITIONED REINFORCEMENT IN PROBABILISTIC CHOICE
نویسندگان
چکیده
منابع مشابه
Contiguity and conditioned reinforcement in probabilistic choice.
In a baseline condition, pigeons chose between an alternative that always provided food following a 30-s delay (100% reinforcement) and an alternative that provided food half of the time and blackout half of the time following 30-s delays (50% reinforcement). The different outcomes were signaled by different-colored keylights. On average, each alternative was chosen approximately equally often,...
متن کاملDual effects on choice of conditioned reinforcement frequency and conditioned reinforcement value.
Pigeons were presented with a concurrent-chains schedule in which the total time to primary reinforcement was equated for the two alternatives (VI 30 s VI 60 s vs. VI 60 s VI 30 s). In one set of conditions, the terminal links were signaled by the same stimulus, and in another set of conditions they were signaled by different stimuli. Choice was in favor of the shorter terminal link when the te...
متن کاملOf Behavior Choice with Uncertain Outcomes : Conditioned Reinforcement Effects Roger
Pigeons responded on concurrent chains with equal initialand terminal-link durations. In all conditions, the terminal links of one chain ended reliably in reinforcement; the terminal links on the alternative chain ended in either food or blackout. In Experiment 1, the terminal-link stimuli were correlated with (signaled) the outcome, and the durations of the initial and terminal links were vari...
متن کاملConditioned reinforcement and response strength.
Stimuli associated with primary reinforcers appear themselves to acquire the capacity to strengthen behavior. This paper reviews research on the strengthening effects of conditioned reinforcers within the context of contemporary quantitative choice theories and behavioral momentum theory. Based partially on the finding that variations in parameters of conditioned reinforcement appear not to aff...
متن کاملProbabilistic Computability and Choice
We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a probabilistic Turing machine that receives a random binary sequence as auxiliary input. The machine can take advantage of this random sequence, but it always h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Experimental Analysis of Behavior
سال: 1997
ISSN: 0022-5002
DOI: 10.1901/jeab.1997.68-317